-
1 reduced-time automaton
English-Russian dictionary of computer science and programming > reduced-time automaton
-
2 automaton
- anthropomorphic automaton
- canonical parsing automaton
- cellular automaton
- completely specified automaton
- deterministic automaton
- digital automaton
- discrete automaton
- finite automaton
- finite state automaton
- finite-memory automaton
- halting automaton
- infinite automaton
- linear-bounded automaton
- Mealy automaton
- Moore automaton
- nondeterministic automaton
- parsing automaton
- partialy specific automaton
- probabilistic automaton
- push-down automaton
- reduced automaton
- reduced-time automaton
- redundant automaton
- self-adjusting automaton
- self-reproducing automaton
- semireduced parsing automaton
- split parsing automaton
- stochastic automaton
- timed automaton
- two-way automatonEnglish-Russian dictionary of computer science and programming > automaton
-
3 automaton
-
4 diagram
диаграмма; схема; график; чертёж; эпюра -
5 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph
См. также в других словарях:
Quantum dot cellular automaton — Quantum Dot Cellular Automata (sometimes referred to simply as quantum cellular automata, or QCA) Any device designed to represent data and perform computation, regardless of the physics principles it exploits and materials used to build it, must … Wikipedia
Von Neumann cellular automaton — Von Neumann cellular automata are the original expression of cellular automata, the development of which were prompted by suggestions made to John von Neumann by his close friend and fellow mathematician Stanisław Ulam. Their original purpose was … Wikipedia
Glossary of chess — See also: Outline of chess and Glossary of chess problems This page explains commonly used terms in chess in alphabetical order. Some of these have their own pages, like fork and pin. For a list of unorthodox chess pieces, see fairy chess… … Wikipedia
List of chess terms — This page explains commonly used terms in chess in alphabetical order. Some of these have their own pages, like fork and pin. For a list of unorthodox chess pieces, see fairy chess piece; for a list of terms specific to chess problems, see chess… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Nagel-Schreckenberg model — The Nagel Schreckenberg model is a theoretical model for the simulation of freeway traffic. The model was developed in the early 90s by the German physicists Kai Nagel and Michael Schreckenberg[1]. It is essentially a simple cellular automaton… … Wikipedia
Switch-technology — is a technology for automata based programming support. It was proposed by Anatoly Shalyto in 1991. It involves software specification, design, implementation, debugging, documentation and maintenance. The term “automata based programming” is… … Wikipedia